Improved EZBC algorithm with low complexity
نویسندگان
چکیده
منابع مشابه
ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملAn improved EZBC algorithm based on block bit length
Embedded ZeroBlock Coding and context modeling (EZBC) algorithm has high compression performance. However, it consumes large amounts of memory space because an Amplitude Quadtree of wavelet coefficients and other two link lists would be built during the encoding process. This is one of the big challenges for EZBC to be used in real time or hardware applications. An improved EZBC algorithm based...
متن کاملImproved Low Complexity Fully Parallel Thinning Algorithm
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes with the best known algorithms regarding homotopy, mediality; thickness, rotation invariance and noise immunity, while featuring a speed improvement by a factor two or more owing to a smaller number of operations to perform. MB2 is grounded on a simple physics-based thinning principle that conveys both...
متن کاملImproved Low-Complexity Interpolation Algorithm for Deinterlacing
In this paper, we propose an improved low-cost deinterlacing method. The conventional low-complexity interpolation method for deinterlacing (LCID) has a observably better exhibition than other method using one field while requiring low complexity. However, sometimes it gives unpleasant subjective performance due to the miscalculating of edge direction. We aim to increase the interpolation accur...
متن کاملAn Improved Low Complexity MIMO-OFDM Detection Algorithm
In this paper, V candidate symbols are considered at the first layer, then V probable streams are detected with complex LLL because of the complexity. Finally, the most probable stream is selected through a ML test. By using complex LLL, the proposed scheme can achieve more low complexity than QRD-M. Simulation results show that the proposed scheme provides similar performance as the QRD-M.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2004
ISSN: 1349-2543
DOI: 10.1587/elex.1.447